On Sets of Integers Which Are Both Sum-free and Product-free
نویسندگان
چکیده
We consider sets of positive integers containing no sum of two elements in the set and also no product of two elements. We show that the upper density of such a set is strictly smaller than 2 and that this is best possible. Further, we also find the maximal order for the density of such sets that are also periodic modulo some positive integer.
منابع مشابه
Sum-free sets and shift automorphisms
A sum-free set, A = {a1, a2, . . . , an}, is a subset of an abelian group such that its intersection with the sumset A + A = {aj + ak : aj , ak ∈ A} is empty. For example, the set of odd integers is sum-free. There are a range of interesting—often open—questions that can be asked about these sets: how big can they be? given the set of the first n integers, how many sum-free subsets are there as...
متن کاملBEST APPROXIMATION IN QUASI TENSOR PRODUCT SPACE AND DIRECT SUM OF LATTICE NORMED SPACES
We study the theory of best approximation in tensor product and the direct sum of some lattice normed spacesX_{i}. We introduce quasi tensor product space anddiscuss about the relation between tensor product space and thisnew space which we denote it by X boxtimesY. We investigate best approximation in direct sum of lattice normed spaces by elements which are not necessarily downwardor upward a...
متن کاملNotes on sum-free and related sets
Our main topic is the number of subsets of 1; n] which are maximal with respect to some condition such as being sum-free, having no number dividing another, etc. We also investigate some related questions. In our earlier paper 8], we considered conditions on sets of positive integers (sum-freeness, Sidon sequences, etc.), and attempted to estimate the number of subsets of 1; n] satisfying each ...
متن کاملThe number of maximal sum-free subsets of integers
Cameron and Erdős [6] raised the question of how many maximal sum-free sets there are in {1, . . . , n}, giving a lower bound of 2bn/4c. In this paper we prove that there are in fact at most 2(1/4+o(1))n maximal sum-free sets in {1, . . . , n}. Our proof makes use of container and removal lemmas of Green [8, 9] as well as a result of Deshouillers, Freiman, Sós and Temkin [7] on the structure of...
متن کاملSum-Free Sets and Related Sets
A set A of integers is sum-free if A\(A+A) = ;. Cameron conjectured that the number of sum-free sets A f1; : : : ; Ng is O(2 N=2). As a step towards this conjecture, we prove that the number of sets A f1
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012